Remarks on the Cartesian product of two graphs
نویسندگان
چکیده
منابع مشابه
The reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملOn subgraphs of Cartesian product graphs
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
متن کاملthe reliability wiener number of cartesian product graphs
reliability wiener number is a modification of the original wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملOn local colorings of Cartesian product graphs
A local coloring of a graph G is a function c : V (G) → N such that for each S ⊆ V (G), 2 ≤ |S| ≤ 3, there exist u, v ∈ S with |c(u) − c(v)| at least the size of the subgraph induced by S. The maximum color assigned by c is the value χl(c) of c, and the local chromatic number of G is χl(G) = min{χl(c) : c local coloring of G}. In this note the local chromatic number is determined for Cartesian ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1962
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-9-1-43-47